Consensus in Directed Networks with Boundary Function Quantized Information Communication

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average consensus on networks with quantized communication

This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...

متن کامل

Consensus over directed static networks with arbitrary finite communication delays.

We study the consensus problem in directed static networks with arbitrary finite communication delays and consider both linear and nonlinear coupling. For the considered networked system, only locally delayed information is available for each node and also the information flow is directed. We find that consensus can be realized whatever the communications delays are. In fact, we do not even nee...

متن کامل

Average consensus with weighting matrix design for quantized communication on directed switching graphs

We study average consensus for directed graphs with quantized communication under fixed and switching topologies. In the presence of quantization errors, conventional consensus algorithms fail to converge and may suffer from an unbounded asymptotic mean square error. We develop robust consensus algorithms to reduce the effect of quantization. Specifically, we introduce a robust weighting matrix...

متن کامل

Gossip consensus algorithms via quantized communication

This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise “gossip” communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quanti...

متن کامل

Distributed dynamic consensus under quantized communication data

Distributed dynamic average consensus is investigated under quantized communication data. We use a uniform quantizer with constant quantization step-size to deal with the saturation caused by the dynamic consensus error and propose a communication feedback-based distributed consensus protocol suitable for directed time-varying topologies to make the internal state of each agent’s encoder consis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Application

سال: 2014

ISSN: 2161-8801,2161-881X

DOI: 10.12677/csa.2014.42008